Pole assignment problem: a structural investigation
نویسندگان
چکیده
منابع مشابه
The Robust Pole Assignment Problem for Second-Order Systems
Pole assignment problems are special algebraic inverse eigenvalue problems. In this paper, we research numerical methods of the robust pole assignment problem for second-order systems. The problem is formulated as an optimization problem. Depending upon whether the prescribed eigenvalues are real or complex, we separate the discussion into two cases and propose two algorithms for solving this p...
متن کاملInvestigation of the Ring Spur Assignment Problem
This paper describes the Ring Spur Assignment Problem (RSAP), an interesting new problem arising in the design of Next Generation Networks. We describe the problem, position it in relation to problems previously addressed in the literature and give an IP model suitable for solving small problem instances. We outline a cutting plane algorithm for larger problem instances and present some computa...
متن کاملRobust Decentralized Pole Assignment
This paper considers the problem of assigning the closed-loop eigenvalues of linear large-scale systems in a desired stable region using decentralized control. A new method for robust decentralized control of the system via eigenstructure assignment of the subsystems is given. Based on the matrix perturbation theory, sufficient conditions for eigenstructure of each isolated subsystem are derive...
متن کاملA Honey Bee Algorithm To Solve Quadratic Assignment Problem
Assigning facilities to locations is one of the important problems, which significantly is influence in transportation cost reduction. In this study, we solve quadratic assignment problem (QAP), using a meta-heuristic algorithm with deterministic tasks and equality in facilities and location number. It should be noted that any facility must be assign to only one location. In this paper, first o...
متن کاملAn Investigation of the Course-Section Assignment Problem
We investigate the problem of enumerating schedules, consisting of course-section assignments, in increasing order of the number of conflicts they contain. We define the problem formally, and then present an algorithm that systematically enumerates solutions for it. The algorithm uses backtracking to perform a depth-first search of the implicit search space defined by the problem, pruning the s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Control
سال: 1991
ISSN: 0020-7179,1366-5820
DOI: 10.1080/00207179108934195